package leetcode.slidingwindow;

import leetcode.slidingwindow.common.SlidingWindowUtils;

class Solution485 {
    public int findMaxConsecutiveOnes(int[] nums) {
        return SlidingWindowUtils.findMaxConsecutiveOnes(nums);

    }
}

public class leetcode485 {
    public static void main(String[] args) {
        Solution485 solution485 = new Solution485();
        int[] nums = {1,1,0,1,1,1};
        int[] nums1 = {1,0,1,1,0,1};
        System.out.println(solution485.findMaxConsecutiveOnes(nums));
        System.out.println(solution485.findMaxConsecutiveOnes(nums1));
    }
}
